Near-Circularity of the Error Curve In Complex Chebyshev Approximation
نویسندگان
چکیده
Let f(z) be analytic on the unit disk, and let p*(z) be the best (Chebyshev) polynomial approximation to f(z) on the disk of degree at most n. It is observed that in typical problems the “error curve,” the image of the unit circle under (f p*)(z), often approximates to a startling degree a perfect circle with winding number n + 1. This phenomenon is approached by consideration of related problems whose error curves are exactly circular, making use of a classical theorem of Caratheodory and Fejer. This leads to a technique for calculating approximations in one step that are roughly as close to best as the best approximation error curve is close to circular, and hence to strong theorems on near-circularity as the radius of the domain shrinks to 0 or as n increases to co. As a computational example, very tight bounds are given for approximation of ez on the unit disk. The generality of the near-circularity phenomenon (more general domains, rational approximation) is discussed.
منابع مشابه
Circularity of the Error Curve and Sharpness of the Cf Method in Complex Chebyshev Approximation *
Let f(z) be analytic at the origin, and for e >0, let f(ez) be best approximated in the Chebyshev sense on the unit disk by a rational function of type (m, n). It has been shown previously by the CF method that the error curve for this approximation deviates from a circle by at most O(e 2m+2n+3) as e 0. We prove here that this bound is sharp in two senses: the error curve for a given function c...
متن کاملCapturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division
In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...
متن کاملNumerical solution of general nonlinear Fredholm-Volterra integral equations using Chebyshev approximation
A numerical method for solving nonlinear Fredholm-Volterra integral equations of general type is presented. This method is based on replacement of unknown function by truncated series of well known Chebyshev expansion of functions. The quadrature formulas which we use to calculate integral terms have been imated by Fast Fourier Transform (FFT). This is a grate advantage of this method which has...
متن کاملReal Polynomial Chebyshev Approximation by the Carathiodory - Fejir Method
A new method is presented for near-best approximation of a real function F on [-r, r] by a polynomial of degree m. The method is derived by transplanting the given problem to the unit disk, then applying the Carath6odory-Fej6r theorem. The resulting near-best approximation is constructed from the principal eigenvalue and eigenvector of a Hankel matrix of Chebyshev coefficients of F. It is well ...
متن کاملError of Truncated Chebyshev Series and Other Near Minimax Polynomial Approximations
It is well known that a near minimax polynomial approximation p is obtained by truncating the Chebyshev series of a function fafter n + 1 terms. It is shown that if /'E C' " + " [-1, I], then 1I.f-pII may be expressed in terms off' " ' I) in the same manner as the error of minimax approximation. The result is extended to other types of near minimax approximation.
متن کامل